Reflection quotients in Riemannian geometry. A geometric converse to Chevalley's theorem

Chevalley's theorem and its converse, the Sheppard-Todd theorem, assert that finite reflection groups are distinguished by the fact that the ring of invariant polynomials is freely generated. We show that, in the Euclidean case, a weaker condition suffices to characterize finite reflection groups, namely, that a freely-generated polynomial subring is closed with respect to the gradient product.

     

束流线性耦合效应的初步研究

在储存环的束流传输系统中,斜四极场和纵向螺线管场是引起束流线性耦合的主要原因.由于这种耦合,使得束流的幅度和发射度发生交换,引起束流横向包络的增大,严重的将造成束流损失.从Betatron运动方程出发研究了斜四极场和螺线管场存在时束流的幅度耦合效应,分析了斜四极场存在时束流发射度的变化.     

A technique to construct symmetric variable-stepsize linear multistep methods for second-order systems

Some previous works show that symmetric fixed- and variable-stepsize linear multistep methods for second-order systems which do not have any parasitic root in their first characteristic polynomial give rise to a slow error growth with time when integrating reversible systems. In this paper, we give a technique to construct variable-stepsize symmetric methods from their fixed-stepsize counterparts, in such a way that the former have the same order as the latter. The order and symmetry of the integrators obtained is proved independently of the order of the underlying fixed-stepsize integrators. As this technique looks for efficiency, we concentrate on explicit linear multistep methods, which just make one function evaluation per step, and we offer some numerical comparisons with other one-step adaptive methods which also show a good long-term behaviour.

     

On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method

For a linear complementarity problem with inconsistent system of constraints a notion of quasi-solution of Tschebyshev type is introduced. It’s shown that this solution can be obtained automatically by Lemke’s method if the constraint matrix of the original problem is copositive plus or belongs to the intersection of matrix classes P ₀ and Q ₀.     

On the advantage over a random assignment

We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful measure for optimization problems where the random assignment algorithm is known to give essentially the best possible polynomial time approximation. In this paper, we focus on this measure for the optimization problems Max‐Lin‐2 in which we need to maximize the number of satisfied linear equations in a system of linear equations modulo 2, and Max‐k‐Lin‐2, a special case of the above problem in which each equation has at most k variables. The main techniques we use, in our approximation algorithms and inapproximability results for this measure, are from Fourier analysis and derandomization. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

一般线性模型下方差最小范数二次无偏估计的稳健性

本文给出了一般线性模型下,由最小二乘得到的方差估计与最小范数二次无偏估计相等的充分必要条件,并且当Gauss-Markov估计与最小二乘估计相等时,可以得到一个简单的等价条件。     

用单一驱动变量同步混沌与超混沌的一种方法

为减少混沌或超混沌同步过程中所需同步信号的个数以及提高同步的效率，提出了用线性可逆变换的方法重组系统，从而使原来不能同步的系统实现了只用单一信号就可同步的目的-另外，也大大提高系统的同步速率- 关键词： 线性可逆变换 混沌和超混沌同步 最大条件Lyapunov指数     

广义线性模型(六)

本讲座是广义线性模型这个题目的一个比较系统的介绍。主要分 3部分 :建模、统计分析与模型选择和诊断。写作时依据的主要参考资料是L .Fahrmeir等人的 :《MultivariateStatisticalModel ingBasedonGeneralizedLinearModles》。     

基于改进的语音参数提取的线性预测

根据语音发生基本原理和线性预测编码原理，针对自相关法需要加窗从而降低了解的精度，而协方差法不能保证保证解所重构出系统的稳定性的特点，提出了一种改进的Cholesky分解的方法求解协方差方程组以产生声道模型参数的方法，实践证明，这种方法既保证了系统的稳定性，又提高了解的精度。     

New Branch-and-Cut Algorithm for Bilevel Linear Programming

Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of randomly generated problems. Work of the authors was partially supported by FCAR, MITACS and NSERC grants.